Expressibility in the Lambda Calculus with Mu
نویسندگان
چکیده
We address a problem connected to the unfolding semantics of functional programming languages: give a useful characterization of those infinite λ-terms that are λletrec-expressible in the sense that they arise as infinite unfoldings of terms in λletrec, the λ-calculus with letrec. We provide two characterizations, using concepts we introduce for infinite λ-terms: regularity, strong regularity, and binding–capturing chains. It turns out that λletrec-expressible infinite λ-terms form a proper subclass of the regular infinite λ-terms. In this paper we establish these characterizations only for expressibility in λμ, the λ-calculus with explicit μ-recursion. We show that for all infinite λ-terms T the following are equivalent: (i): T is λμ-expressible; (ii): T is strongly regular; (iii): T is regular, and it only has finite binding–capturing chains. We define regularity and strong regularity for infinite λ-terms as two different generalizations of regularity for infinite first-order terms: as the existence of only finitely many subterms that are defined as the reducts of two rewrite systems for decomposing λ-terms. These rewrite systems act on infinite λ-terms furnished with a bracketed prefix of abstractions for collecting decomposed λ-abstractions and keeping the terms closed under decomposition. They differ in which vacuous abstractions in the prefix are removed. This report accompanies the article [9], and mainly differs from that by providing the proof of the characterization of λμ-expressibility with binding–capturing chains. 1998 ACM Subject Classification F.3.3 Studies of Program Constructs
منابع مشابه
On the denotational semantics of the untyped lambda-mu calculus
Starting with the idea of reflexive objects in Selinger’s control categories, we define three different denotational models of Parigot’s untyped lambda-mu calculus. The first one is built from an intersection types system for the lambda-mu calculus leading to a generalization of Engeler’s model of the untyped lambda calculus. The second model introduces correlation spaces (coming from Girard’s ...
متن کاملDenotational Semantics of Call-by-name Normalization in Lambda-mu Calculus
We study normalization in the simply typed lambda-mu calculus, an extension of lambda calculus with control flow operators. Using an enriched version of the Yoneda embedding, we obtain a categorical normal form function for simply typed lambda-mu terms, which gives a special kind of a call-by-name denotational semantics particularly useful for deciding equalities in the lambda-mu calculus.
متن کاملExtensional Models of Untyped Lambda-mu Calculus
This paper proposes new mathematical models of the untyped Lambda-mu calculus. One is called the stream model, which is an extension of the lambda model, in which each term is interpreted as a function from streams to individual data. The other is called the stream combinatory algebra, which is an extension of the combinatory algebra, and it is proved that the extensional equality of the Lambda...
متن کاملExplicit Substitutions for the Lambda � Mu Calculus �
We present a con uent rewrite system which extents a previous calculus of explicit substitu tions for the lambda calculus HaLe to Parigot s untyped lambda mu calculus Par This extension embeds the lambda mu calculus as a sub theory and provides the basis for a theoretical framework to study the abstract properties of implementations of functional pro gramming languages enriched with control str...
متن کامل